computational complexity theory - PDFSEARCH.IO - Document Search Engine

computational complexity theory
Results: 2049

#	Item
631	On Lagrangian Relaxation and Subset Selection Problems (Extended Abstract) Ariel Kulik∗ Hadas Shachnai† Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2008-06-23 10:33:06 Theoretical computer science Computational complexity theory Relaxation Linear programming Approximation algorithm Lagrangian relaxation Duality Spectral theory of ordinary differential equations Euclidean algorithm Mathematical optimization Mathematical analysis Convex optimization
632	Distributed Computing FS 2011 Prof. R. Wattenhofer Barbara Keller Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:47 Analysis of algorithms Bellman–Ford algorithm Time complexity Search algorithms Routing algorithms Koorde Randomized algorithm Theoretical computer science Computational complexity theory Applied mathematics
633	Algorithms Lecture 30: NP-Hard Problems [Fa’14] [I]n his short and broken treatise he provides an eternal example—not of laws, or even of method, for there is no method except to be very intelligent, but Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 09:03:23 Complexity classes Mathematical optimization Structural complexity theory Computability theory NP-hard NP-complete Boolean satisfiability problem Cook–Levin theorem P versus NP problem Theoretical computer science Computational complexity theory Applied mathematics
634	MATHEMATICS PROBLEMS WITH SEPARATE PROGRESSIVE SOLUTIONS: HINTS, ALGORITHMS, PROOFS VOLUME 1: INTERMEDIATE AND COLLEGE ALGEBRA Add to Reading List Source URL: probability.infarom.ro Language: English - Date: 2015-04-15 00:21:34 Solver Problem solving Algorithm Problem Skill Theoretical computer science Computational complexity theory Linear programming Mathematics Applied mathematics Numerical software
635	Journal of Artificial Intelligence Research606 Submitted 11/07; publishedSATzilla: Portfolio-based Algorithm Selection for SAT Lin Xu Add to Reading List Source URL: jair.org Language: English - Date: 2008-07-01 13:34:37 NP-complete problems Logic in computer science Electronic design automation Formal methods Boolean algebra Boolean satisfiability problem Algorithm Computational complexity theory Solver Theoretical computer science Applied mathematics Mathematics
636	CCCG 2011, Toronto ON, August 10–12, 2011 Robust approximate assembly partitioning Elisha Sacks∗ Victor Milenkovic† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:12 Analysis of algorithms Computational complexity theory Convex geometry Digital geometry Minkowski addition Algorithm Time complexity Mathematics Theoretical computer science Geometry
637	Case Study 5: Reduction Mill BRITISH STEEL The diagram opposite represents a cold reduction mill. It consists of five pairs of workrolls. The Add to Reading List Source URL: www.cimt.plymouth.ac.uk Language: English - Date: 2005-08-11 12:58:10 Chemical engineering Building engineering Heat transfer R-value Thermal protection Reduction Rolling Computational complexity theory Mechanical engineering Metal forming
638	Toward A Taxonomy of “Small” Genres and Writing Techniques for WAC Add to Reading List Source URL: wac.colostate.edu Language: English - Date: 2010-12-27 11:55:50 Operations research Complexity classes Epistemology NP Algorithm Problem frames approach Canadian traveller problem Theoretical computer science Computational complexity theory Applied mathematics
639	Microsoft Word - Simp&Comp.doc Add to Reading List Source URL: mcs.open.ac.uk Language: English - Date: 2013-07-03 05:55:52 Holism Computer programming Diagrams Computational complexity theory Complex systems theory Complexity Programming language Subroutine Reduction Computing Theoretical computer science Software engineering
640	Chapter 12 Stabilization A large branch of research in distributed computing deals with fault-tolerance. Being able to tolerate a considerable fraction of failing or even maliciously behaving (“Byzantine”) nodes whi Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:48 Mathematics Self-stabilization Randomized algorithm Search algorithms Routing algorithms Small world routing Superstabilization Theoretical computer science Computational complexity theory Fault-tolerant computer systems

UPDATE